Efficient Algorithms for the max k -vertex cover Problem
نویسندگان
چکیده
We first devise moderately exponential exact algorithms for max k-vertex cover, with time-complexity exponential in n but with polynomial space-complexity by developing a branch and reduce method based upon the measure-and-conquer technique. We then prove that, there exists an exact algorithm for max k-vertex cover with complexity bounded above by the maximum among c and γ , for some γ < 2, where τ is the cardinality of a minimum vertex cover of G (note that max k-vertex cover / ∈ FPT with respect to parameter k unless FPT = W[1]), using polynomial space. We finally study approximation of max k-vertex cover by moderately exponential algorithms. The general goal of the issue of moderately exponential approximation is to catch-up on polynomial inapproximability, by providing algorithms achieving, with worst-case running times importantly smaller than those needed for exact computation, approximation ratios unachievable in polynomial time.
منابع مشابه
Combinatorial approximation of maximum k-vertex cover in bipartite graphs within ratio~0.7
We propose a purely combinatorial algorithm for max k-vertex cover in bipartite graphs, achieving approximation ratio 0.7. The only combinatorial algorithms currently known until now for this problem are the natural greedy algorithm, that achieves ratio (e−1)/e = 0.632, and an easy 2/3-approximation algorithm presented in [4].
متن کاملNew lower bounds for Approximation Algorithms in the Lovász-Schrijver Hierarchy
Determining how well we can efficiently compute approximate solutions to NPhard problems is of great theoretical and practical interest. Typically the famous PCP theorem is used for showing that a problem has no algorithms computing good approximations. Unfortunately, for many problem this approach has failed. Nevertheless, for such problems, we may instead be able to show that a large subclass...
متن کاملImproved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems
Given an undirected weighted graph G = (V,E), a set C1, C2, . . . , Ck of cycles is called a cycle cover of V ′ if V ′ ⊂ ∪i=1V (Ci) and its cost is the maximum weight of the cycles. The Min-Max Cycle Cover Problem(MMCCP) is to find a minimum cost cycle cover of V with at most k cycles. The Rooted Min-Max Cycle Cover Problem(RMMCCP) is to find a minimum cost cycle cover of V \D with at most k cy...
متن کاملA 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs
Given a graph G = (V,E) with n vertices and an integer k 6 n, Max k-Vertex Cover consists of determining a subset K ⊆ V that covers the most of edges in E. We study the polynomial approximation of Max k-Vertex Cover in bipartite graphs by a purely combinatorial algorithm and present an experimental analysis of it that finds the worst case approximation guarantee that is bounded below by 0.794. ...
متن کاملApproximation Algorithms for Maximization Problems Arising in Graph Partitioning
Given a graph G = (V;E), a weight function w : E ! R+ and a parameter k we examine a family of maximization problems arising naturally when considering a subset U V of size exactly k. Speci cally we consider the problem of nding a subset U V of size k that maximizes : Max-k-Vertex Cover : the weight of edges incident with vertices in U . Max-k-Dense Subgraph : the weight of edges in the subgrap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Optim.
دوره 28 شماره
صفحات -
تاریخ انتشار 2012